Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 464 results
Sort by: relevance publication year

Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits

JOURNAL ARTICLE published November 1995 in Information Processing Letters

Authors: Y.Daniel Liang | Norbert Blum

https://doi.org/10.1016/0020-0190(95)00145-3 Actions

An optimal algorithm for finding maximum induced bipartite subgraphs of circular-arc graphs

PROCEEDINGS ARTICLE published in Proceedings ICCI `92: Fourth International Conference on Computing and Information

https://doi.org/10.1109/icci.1992.227707 Actions

Solving the shortest-paths problem on bipartite permutation graphs efficiently

JOURNAL ARTICLE published September 1995 in Information Processing Letters

Authors: Lin Chen

https://doi.org/10.1016/0020-0190(95)00084-p Actions

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

JOURNAL ARTICLE published January 1987 in Information Processing Letters

Authors: Taenam Kim | Kyung-Yong Chwa

https://doi.org/10.1016/0020-0190(87)90193-1 Actions

On maximum induced matchings in bipartite graphs

JOURNAL ARTICLE published January 2002 in Information Processing Letters

Authors: V.V. Lozin

https://doi.org/10.1016/s0020-0190(01)00185-5 Actions

Improved Trellis-Based Algorithm for Locating and Breaking Cycles in Bipartite Graphs with Applications to LDPC Codes

PROCEEDINGS ARTICLE published February 2018 in 2018 Information Theory and Applications Workshop (ITA)

Authors: Juane Li | Shu Lin | Khaled Abdel-Ghaffar

https://doi.org/10.1109/ita.2018.8503249 Actions

Edge domination on bipartite permutation graphs and cotriangulated graphs

JOURNAL ARTICLE published November 1995 in Information Processing Letters

Authors: Anand Srinivasan | K. Madhukar | P. Nagavamsi | C.Pandu Rangan | Maw-Shang Chang

https://doi.org/10.1016/0020-0190(95)94093-8 Actions

A self-stabilizing algorithm for coloring bipartite graphs

JOURNAL ARTICLE published April 1993 in Information Sciences

Authors: Sumit Sur | Pradip K. Srimani

https://doi.org/10.1016/0020-0255(93)90121-2 Actions

Variations of the maximum leaf spanning tree problem for bipartite graphs

JOURNAL ARTICLE published February 2006 in Information Processing Letters

Authors: (Ben) P.C. Li | M. Toulouse

https://doi.org/10.1016/j.ipl.2005.10.011 Actions

Parallel maximum independent set in convex bipartite graphs

JOURNAL ARTICLE published September 1996 in Information Processing Letters

Authors: Artur Czumaj | Krzysztof Diks | Teresa M. Przytycka

https://doi.org/10.1016/0020-0190(96)00131-7 Actions

Linear-time optimal augmentation for componentwise bipartite-completeness of graphs

JOURNAL ARTICLE published April 1995 in Information Processing Letters

Authors: Ming-Yang Kao

https://doi.org/10.1016/0020-0190(94)00229-r Actions

Analysis of approximate algorithms for edge-coloring bipartite graphs

JOURNAL ARTICLE published May 1995 in Information Processing Letters

Authors: Ravi Jain | John Werth

https://doi.org/10.1016/0020-0190(95)00013-3 Actions

An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

JOURNAL ARTICLE published October 1992 in Information Processing Letters

Authors: Ju Yuan Hsiao | Chuan Yi Tang | Ruay Shiung Chang

https://doi.org/10.1016/0020-0190(92)90216-i Actions

A simple matching algorithm for regular bipartite graphs

JOURNAL ARTICLE published November 2002 in Information Processing Letters

Authors: Kazuhisa Makino | Takashi Takabatake | Satoru Fujishige

https://doi.org/10.1016/s0020-0190(02)00273-9 Actions

A polynomial algorithm for the extendability problem in bipartite graphs

JOURNAL ARTICLE published January 1998 in Information Processing Letters

Authors: J. Lakhal | L. Litzler

https://doi.org/10.1016/s0020-0190(97)00177-4 Actions

Iterative Message Passing Algorithm for Bipartite Maximum Weighted Matching

PROCEEDINGS ARTICLE published July 2006 in 2006 IEEE International Symposium on Information Theory

Authors: Yuan-sheng Cheng | Michael Neely | Keith M. Chugg

https://doi.org/10.1109/isit.2006.261818 Actions

An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs

JOURNAL ARTICLE published November 2006 in Information Processing Letters

Authors: Chor Ping Low

https://doi.org/10.1016/j.ipl.2006.06.004 Actions

An adjustable linear time parallel algorithm for maximum weight bipartite matching

JOURNAL ARTICLE published March 2006 in Information Processing Letters

Authors: Morteza Fayyazi | David Kaeli | Waleed Meleis

https://doi.org/10.1016/j.ipl.2005.10.013 Actions

Envy-free matchings in bipartite graphs and their applications to fair division

JOURNAL ARTICLE published March 2022 in Information Sciences

Research funded by Israel Science Foundation (712/20)

Authors: Elad Aigner-Horev | Erel Segal-Halevi

https://doi.org/10.1016/j.ins.2021.11.059 Actions

Computing Maximum Non-crossing Matching in Convex Bipartite Graphs

BOOK CHAPTER published 2012 in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Authors: Danny Z. Chen | Xiaomin Liu | Haitao Wang

https://doi.org/10.1007/978-3-642-29700-7_10 Actions
Feedback: support@crossref.org